#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,T;cin>>n>>T;
  LL mx=1e18;
  for(LL i=1;i<=n;i++){
    cin>>a[i];mx=min(mx,a[i]);
  }
  LL ans=0;
  while(T>=mx){
     LL tmp=0;LL sum=0;
     for(LL i=1;i<=n;i++){
        if(T>=a[i]){
            T-=a[i];
            tmp++;
            sum+=a[i];
        }
     }
     ans+=tmp;
     ans+=tmp*(T/sum);
     T%=sum;
  }
  cout<<ans<<"\n";
return 0;
}
